On some L(2, 1)-coloring parameters of certain graph classes
نویسندگان
چکیده
منابع مشابه
On the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولSelective Graph Coloring in Some Special Classes of Graphs
In this paper, we consider the selective graph coloring problem. Given an integer k ≥ 1 and a graph G = (V,E) with a partition V1, . . . , Vp of V , it consists in deciding whether there exists a set V ∗ in G such that |V ∗ ∩ Vi| = 1 for all i ∈ {1, . . . , p}, and such that the graph induced by V ∗ is k-colorable. We investigate the complexity status of this problem in various classes of graphs.
متن کاملOn the hull number of some graph classes . 1
Given a graph G = (V, E), the closed interval of a pair of vertices u, v ∈ V , denoted by I[u, v], is the set of vertices that belongs to some shortest (u, v)-path. The convex hull I h [S] of a subset S ⊆ V is the smallest convex set that contains S. We say that S is a hull set if I h [S] = V. The cardinality of a minimum hull set of G is the hull number of G, denoted by hn(G). We show that dec...
متن کاملOn the complexity of the selective graph coloring problem in some special classes of graphs
In this paper, we consider the selective graph coloring problem. Given an integer k ≥ 1 and a graph G = (V,E) with a partition V1, . . . , Vp of V , it consists in deciding whether there exists a set V ∗ in G such that ∣V ∗ ∩ Vi∣ = 1 for all i ∈ {1, . . . , p}, and such that the graph induced by V ∗ is k-colorable. We investigate the complexity status of this problem in various classes of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Universitatis Sapientiae, Informatica
سال: 2019
ISSN: 2066-7760
DOI: 10.2478/ausi-2019-0013